Parameterized Aspects of Strong Subgraph Closure
نویسندگان
چکیده
منابع مشابه
Parameterized Aspects of Strong Subgraph Closure
Motivated by the role of triadic closures in social networks, and the importance of finding a maximum subgraph avoiding a fixed pattern, we introduce and initiate the parameterized study of the Strong F -closure problem, where F is a fixed graph. This is a generalization of Strong Triadic Closure, whereas it is a relaxation of F free Edge Deletion. In Strong F -closure, we want to select a maxi...
متن کاملParameterized Complexity of Even/Odd Subgraph Problems
Article history: Available online 11 March 2011
متن کاملStrong Subgraph $k$-connectivity
Generalized connectivity introduced by Hager (1985) has been studied extensively in undirected graphs and become an established area in undirected graph theory. For connectivity problems, directed graphs can be considered as generalizations of undirected graphs. In this paper, we introduce a natural extension of generalized k-connectivity of undirected graphs to directed graphs (we call it stro...
متن کاملStrong subgraph $k$-connectivity bounds
Let D = (V,A) be a digraph of order n, S a subset of V of size k and 2 ≤ k ≤ n. Strong subgraphs D1, . . . , Dp containing S are said to be internally disjoint if V (Di)∩V (Dj) = S and A(Di)∩A(Dj) = ∅ for all 1 ≤ i < j ≤ p. Let κS(D) be the maximum number of internally disjoint strong digraphs containing S in D. The strong subgraph kconnectivity is defined as κk(D) = min{κS(D) | S ⊆ V, |S| = k}...
متن کاملParameterized Aspects of Triangle Enumeration
Listing all triangles in an undirected graph is a fundamental graph primitive with numerous applications. It is trivially solvable in time cubic in the number of vertices. It has seen a significant body of work contributing to both theoretical aspects (e.g., lower and upper bounds on running time, adaption to new computational models) as well as practical aspects (e.g. algorithms tuned for larg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2020
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-020-00684-9